Associated graphs and chain maps
نویسندگان
چکیده
منابع مشابه
Intersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملAssociated Graphs of Modules Over Commutative Rings
Let $R$ be a commutative ring with identity and let $M$ be an $R$-module. In this paper we introduce a new graph associated to modules over commutative rings. We study the relationship between the algebraic properties of modules and their associated graphs. A topological characterization for the completeness of the special subgraphs is presented. Also modules whose associated graph is complete...
متن کاملChain graphs: semantics and expressiveness
A chain graph (CG) is a graph admitting both directed and undirected edges with forbidden directed cycles. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). CGs can be used eeciently to store graphoids, that is, independency knowledge of the form \X is independent of Y given Z" obeying a set of ve properties (axioms). Two equivalent criter...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Delta Journal of Science
سال: 2016
ISSN: 2735-5306
DOI: 10.21608/djs.2016.139913